Search results for "discrete [space-time]"

showing 10 items of 2035 documents

Asymptotically good codes from generalized algebraic-geometry codes

2005

We consider generalized algebraic-geometry codes, based on places of the same degree of a fixed algebraic function field over a finite field. In this note, using a method similar to the Justesen's one, we construct a family of such codes which is asymptotically good.

Algebraic function fieldBlock codeDiscrete mathematicsFunction field of an algebraic varietyApplied MathematicsReal algebraic geometryAlgebraic extensionAlgebraic functionLinear codeExpander codeComputer Science ApplicationsMathematics
researchProduct

ON AUTOMORPHISMS OF GENERALIZED ALGEBRAIC-GEOMETRY CODES.

2007

Abstract We consider a class of generalized algebraic-geometry codes based on places of the same degree of a fixed algebraic function field over a finite field F / F q . We study automorphisms of such codes which are associated with automorphisms of F / F q .

Algebraic function fieldDiscrete mathematicsAlgebraic cycleFinite fieldFunction field of an algebraic varietyAlgebra and Number TheoryAutomorphisms of the symmetric and alternating groupsAlgebraic extensionAlgebraic geometryAutomorphismMathematics
researchProduct

Theorems of ascoli type involving measures of noncompactness

1981

Almost periodic functionDiscrete mathematicsMetric spacePure mathematicsApplied MathematicsType (model theory)AnalysisMathematicsNonlinear Analysis: Theory, Methods & Applications
researchProduct

Quantum state engineering using one-dimensional discrete-time quantum walks

2017

Quantum state preparation in high-dimensional systems is an essential requirement for many quantum-technology applications. The engineering of an arbitrary quantum state is, however, typically strongly dependent on the experimental platform chosen for implementation, and a general framework is still missing. Here we show that coined quantum walks on a line, which represent a framework general enough to encompass a variety of different platforms, can be used for quantum state engineering of arbitrary superpositions of the walker's sites. We achieve this goal by identifying a set of conditions that fully characterize the reachable states in the space comprising walker and coin, and providing …

Angular momentumComputer scienceQuantum dynamicsQuantum technologiesFOS: Physical sciencesQuantum simulator02 engineering and technologyTopologySpace (mathematics)01 natural sciencesSettore FIS/03 - Fisica Della Materia010305 fluids & plasmasSet (abstract data type)Open quantum systemQuantum statequantum informationQuantum mechanics0103 physical sciencesExperimental platformquantum walksQuantum walk010306 general physicsPhysicsQuantum networkQuantum PhysicsHigh-dimensional systemsQuantum state preparationbusiness.industryOrbital angular momentumQuantum-state engineeringArbitrary superpositionOne-way quantum computer021001 nanoscience & nanotechnologyAtomic and Molecular Physics and OpticsArbitrary quantum stateQuantum technologyDiscrete time and continuous timeLine (geometry)PhotonicsQuantum Physics (quant-ph)0210 nano-technologybusiness
researchProduct

Angular Pseudomomentum Theory for the Generalized Nonlinear Schr\"{o}dinger Equation in Discrete Rotational Symmetry Media

2009

We develop a complete mathematical theory for the symmetrical solutions of the generalized nonlinear Schr\"odinger equation based on the new concept of angular pseudomomentum. We consider the symmetric solitons of a generalized nonlinear Schr\"odinger equation with a nonlinearity depending on the modulus of the field. We provide a rigorous proof of a set of mathematical results justifying that these solitons can be classified according to the irreducible representations of a discrete group. Then we extend this theory to non-stationary solutions and study the relationship between angular momentum and pseudomomentum. We illustrate these theoretical results with numerical examples. Finally, we…

Angular momentumRotational symmetryFOS: Physical sciencesMultidimensional discrete solitonsPattern Formation and Solitons (nlin.PS)01 natural sciences010305 fluids & plasmasSchrödinger equationsymbols.namesake0103 physical sciences010306 general physicsNonlinear Schrodinger equationNonlinear Sciences::Pattern Formation and SolitonsNonlinear Schrödinger equationMathematicsAngular pseudomomentumMathematical analysisFísicaStatistical and Nonlinear PhysicsCondensed Matter PhysicsNonlinear Sciences - Pattern Formation and SolitonsMathematical theoryCondensed Matter - Other Condensed MatterNonlinear systemClassical mechanicsIrreducible representationsymbolsDiscrete symmetry mediaSolitonMATEMATICA APLICADAOther Condensed Matter (cond-mat.other)
researchProduct

Linear and cyclic radio k-labelings of trees

2007

International audience; Motivated by problems in radio channel assignments, we consider radio k-labelings of graphs. For a connected graph G and an integer k ≥ 1, a linear radio k-labeling of G is an assignment f of nonnegative integers to the vertices of G such that |f(x)−f(y)| ≥ k+1−dG(x,y), for any two distinct vertices x and y, where dG(x,y) is the distance between x and y in G. A cyclic k-labeling of G is defined analogously by using the cyclic metric on the labels. In both cases, we are interested in minimizing the span of the labeling. The linear (cyclic, respectively) radio k-labeling number of G is the minimum span of a linear (cyclic, respectively) radio k-labeling of G. In this p…

Applied Mathematics010102 general mathematicsGraph theory[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM]Astrophysics::Cosmology and Extragalactic Astrophysics0102 computer and information sciences[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Span (engineering)01 natural sciencesUpper and lower boundsCombinatoricsGraph theory[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]IntegerRadio channel assignment010201 computation theory & mathematicsCyclic and linear radio k-labelingMetric (mathematics)Path (graph theory)Discrete Mathematics and CombinatoricsOrder (group theory)0101 mathematicsMSC 05C15 05C78ConnectivityMathematics
researchProduct

Preface

2018

This issue of Discrete and Continuous Dynamical Systems-Series S focuses on the qualitative analysis of some concrete nonlinear problems, e.g., ordinary, partial differential equations, systems and inclusions. The ten contributions collected here give an overview on some very recent results on the existence, multiplicity and sign information of the solutions of a wide range of nonlinear differential problems involving different boundary value conditions and operators in divergence form. In our opinion, the synergy pointed out here between the classical nonlinear analysis methods, like the critical point theory, sub-super solutions methods, truncation and comparison techniques, Morse theory,…

Applied MathematicsAnalysiDiscrete Mathematics and CombinatoricsDiscrete Mathematics and CombinatoricAnalysisDiscrete & Continuous Dynamical Systems - S
researchProduct

Melnikov functions and Bautin ideal

2001

The computation of the number of limit cycles which appear in an analytic unfolding of planar vector fields is related to the decomposition of the displacement function of this unfolding in an ideal of functions in the parameter space, called the Ideal of Bautin. On the other hand, the asymptotic of the displacement function, for 1-parameter unfoldings of hamiltonian vector fields is given by Melnikov functions which are defined as the coefficients of Taylor expansion in the parameter. It is interesting to compare these two notions and to study if the general estimations of the number of limit cycles in terms of the Bautin ideal could be reduced to the computations of Melnikov functions for…

Applied MathematicsComputationMathematical analysisPlanar vector fieldsParameter spacesymbols.namesakeDisplacement functionTaylor seriessymbolsDiscrete Mathematics and CombinatoricsVector fieldHamiltonian (quantum mechanics)Melnikov methodMathematicsQualitative Theory of Dynamical Systems
researchProduct

On the steady state problem of the chemotaxis-consumption model with logistic growth and Dirichlet boundary condition for signal

2023

This paper concerns the steady state problem for chemotaxis consumption system with logistic growth and constant concentration of chemoat-tractant on the boundary of the domain. We establish the existence of a non-constant positive solution to this problem. The uniqueness of this solution is obtained under the smallness assumption on the boundary data. Some qualitative properties of the solutions and numerical results are presented.

Applied MathematicsDiscrete Mathematics and CombinatoricsDiscrete and Continuous Dynamical Systems - B
researchProduct

Heuristics and meta-heuristics for 2-layer straight line crossing minimization

2003

AbstractThis paper presents extensive computational experiments to compare 12 heuristics and 2 meta-heuristics for the problem of minimizing straight-line crossings in a 2-layer graph. These experiments show that the performance of the heuristics (largely based on simple ordering rules) drastically deteriorates as the graphs become sparser. A tabu search metaheuristic yields the best results for relatively dense graphs, with a GRASP implementation as close second. Furthermore, the GRASP approach outperforms all other approaches when tackling low-density graphs.

Applied MathematicsGRASPDiscrete Mathematics and CombinatoricsMinificationHeuristicsMetaheuristicAlgorithmGraphTabu searchMathematicsDiscrete Applied Mathematics
researchProduct